On combinatorial auction and Lagrangean relaxation for distributed resource scheduling
نویسندگان
چکیده
Most existing methods for scheduling are based on centralized or hierarchical decision making using monolithic models. In this study, we investigate a new method based on a distributed and locally autonomous decision structure using the notion of combinatorial auction. In combinatorial auction the bidders demand a combination of dependent objects with a single bid. We show that not only can we use this auction mechanism to handle complex resource scheduling problems, but there exist strong links between combinatorial auction and Lagrangean-based decomposition. Exploring some of these properties, we characterize combinatorial auction using auction protocols and payment functions. This study is a rst step toward developing a distributed scheduling framework that maintains system-wide performance while accommodating local preferences and objectives. We provide some insights to this framework by demonstrating four di erent versions of the auction mechanism using job shop scheduling problems.
منابع مشابه
An Auction-Theoretic Modeling of Production Scheduling to Achieve Distributed Decision Making Dissertation Proposal
Most existing methods for scheduling are based on centralized or hierarchical decision making using monolithic models. In this study, we investigate a new generation of scheduling methods based on a distributed and locally autonomous decision structure. Speciically, we propose a decision structure based on auction theory. The basic idea is to localize and distribute the functionality of schedul...
متن کاملIterative Combinatorial Auctions: Theory and Practice
Combinatorial auctions, which allow agents to bid directly for bundles of resources, are necessary for optimal auction-based solutions to resource allocation problems with agents that have non-additive values for resources, such as distributed scheduling and task assignment problems. We introduce iBundle, the first iterative combinatorial auction that is optimal for a reasonable agent bidding s...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملResource Dedication Problem in a Multi-Project Environment
There can be different approaches to the management of resources within the context of multiproject scheduling problems. In general, approaches to multi-project scheduling problems consider the resources as a pool shared by all projects. On the other hand, when projects are distributed geographically or sharing resources between projects is not preferred, then this resource sharing policy may n...
متن کاملAgents' Bidding Strategies in a Combinatorial Auction Controlled Grid Environment
We present an agent-based simulation environment for resource allocation in a distributed computer system that employs a combinatorial task scheduler. Our environment enables the simulation of a mechanism for the simultaneous allocation of resources like CPU time (CPU), communication bandwidth (NET), volatile (MEM) and non-volatile memory (DSK) in the distributed computer system. In contrast to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998